Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers
نویسندگان
چکیده
In this paper we present linear time approximation schemes for several generalized matching problems on nonbipartite graphs. Our results include O (m)-time algorithms for (1 − )maximum weight f -factor and (1+ )-approximate minimum weight f -edge cover. As a byproduct, we also obtain direct algorithms for the exact cardinality versions of these problems running in O(m √ f(V )) time. The technical contributions of this work include an efficient method for maintaining relaxed complementary slackness in generalized matching problems and approximation-preserving reductions between the f -factor and f -edge cover problems. ∗Supported by NSF grants CCF-1217338, CNS-1318294, CCF-1514383, and CCF-1637546. ar X iv :1 70 6. 05 76 1v 2 [ cs .D S] 2 7 Ju l 2 01 7
منابع مشابه
Approximate solutions of homomorphisms and derivations of the generalized Cauchy-Jensen functional equation in $C^*$-ternary algebras
In this paper, we prove Hyers-Ulam-Rassias stability of $C^*$-ternary algebra homomorphism for the following generalized Cauchy-Jensen equation $$eta mu fleft(frac{x+y}{eta}+zright) = f(mu x) + f(mu y) +eta f(mu z)$$ for all $mu in mathbb{S}:= { lambda in mathbb{C} : |lambda | =1}$ and for any fixed positive integer $eta geq 2$ on $C^*$-ternary algebras by using fixed poind alternat...
متن کاملGraceful labelings of the generalized Petersen graphs
A graceful labeling of a graph $G=(V,E)$ with $m$ edges is aninjection $f: V(G) rightarrow {0,1,ldots,m}$ such that the resulting edge labelsobtained by $|f(u)-f(v)|$ on every edge $uv$ are pairwise distinct. For natural numbers $n$ and $k$, where $n > 2k$, a generalized Petersengraph $P(n, k)$ is the graph whose vertex set is ${u_1, u_2, cdots, u_n} cup {v_1, v_2, cdots, v_n}$ and its edge set...
متن کاملPartial covers of graphs
Given graphs G and H, a mapping f : V (G) → V (H) is a homomorphism if (f(u), f(v)) is an edge of H for every edge (u, v) of G. In this paper, we initiate the study of computational complexity of locally injective homomorphisms called partial covers of graphs. We motivate the study of partial covers by showing a correspondence to generalized (2,1)-colorings of graphs, the notion stemming from a...
متن کاملSigned B-edge Covers of Graphs
We study a signed variant of edge covers of graphs. Let b be a positive integer, and let G be a graph with minimum degree at least b. A signed b-edge cover of G is a function f : E(G) → {−1, 1} satisfying e∈EG(v) f(e) ≥ b for every v ∈ V (G). The minimum of the values of e∈E(G) f(e), taken over all signed b-edge covers f of G, is called the signed b-edge cover number and is denoted by ρb(G). Fo...
متن کاملDeterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time
We consider the problems of maintaining an approximate maximum matching and an approximate minimum vertex cover in a dynamic graph undergoing a sequence of edge insertions/deletions. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solom...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1706.05761 شماره
صفحات -
تاریخ انتشار 2017